Planar Grouping for Fast Affine Transformation and Clipping
نویسندگان
چکیده
We introduce planar grouping, a technique where planar relationship information is gathered for a set of rigid points. This information is used to accelerate affine transformations and clipping. The planar grouping technique is an optimization problem, implemented in a best-first greedy search. We present two error metrics, one simple and fast, one based on the quadric error metric (QEM) to achieve higher quality planar grouping. We also apply the quadric error metric to linear grouping.
منابع مشابه
Real-time affine region tracking and coplanar grouping
We present a novel approach for tracking locally planar regions in an image sequence and their grouping into larger planar surfaces. The tracker recovers the affine transformation of the region and therefore yields reliable point correspondences between frames. Both edges and texture information are exploited in an integrated way, while not requiring the complete region’s contour. The tracker w...
متن کاملImproved Linear Grouping
Linear grouping is a technique where linear relationship information is gathered for a set of rigid points. This information is used to accelerate vertex transformation, vertex clipping, texture transformation, etc. The linear grouping technique is an optimization problem, originally implemented in a best-first branch-and-bound search. In this paper, we introduce several new extensions and impr...
متن کاملDesign of a Novel Framework to Control Nonlinear Affine Systems Based on Fast Terminal Sliding-Mode Controller
In this paper, a novel approach for finite-time stabilization of uncertain affine systems is proposed. In the proposed approach, a fast terminal sliding mode (FTSM) controller is designed, based on the input-output feedback linearization of the nonlinear system with considering its internal dynamics. One of the main advantages of the proposed approach is that only the outputs and external state...
متن کاملThe Line Clipping Algorithm Basing on Affine Transformation
A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the lin...
متن کاملCharacterizing Global Minimizers of the Difference of Two Positive Valued Affine Increasing and Co-radiant Functions
Many optimization problems can be reduced to a problem with an increasing and co-radiant objective function by a suitable transformation of variables. Functions, which are increasing and co-radiant, have found many applications in microeconomic analysis. In this paper, the abstract convexity of positive valued affine increasing and co-radiant (ICR) functions are discussed. Moreover, the ...
متن کامل